Universal Bufferless Packet Switching
نویسندگان
چکیده
منابع مشابه
Universal Bufferless Packet Switching
A packet-switching algorithm specifies the actions of the nodes in order to deliver packets in the network. A packet-switching algorithm is universal if it applies to any network topology and for any batch communication problem on the network. A long standing open problem has concerned the existence of a universal packet-switching algorithm with near optimal performance guarantees for the class...
متن کاملBuffering ⊲ Packet Switching in Single Buffer Bufferless Packet Switching ⊲
1. Aggarwal, A., Vitter, J.S.: The input/output complexity of sorting and related problems. Commun. ACM 31, 1116–1127 (1988) 2. Arge, L.A.: External memory data structures. In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Massive Data Sets, pp. 313–357. Kluwer, Dordrecht (2002) 3. Arge, L.A.: The Buffer Tree: A technique for designing batched external data structures. Algorith...
متن کاملEfficient bufferless packet switching on trees and leveled networks
In bufferless networks the packets cannot be buffered while they are in transit; thus, once injected, the packets have to move constantly. Bufferless networks are interesting because they model optical networks. We consider the tree and leveled network topologies, which represent a wide class of network configurations. On these networks, we study many-to-one batch problems where each node is th...
متن کاملUniversal Bufferless Routing
In a routing problem, a set of packets must be routed from their sources to their destinations along specified paths in a connected network. Given paths with congestion C and dilation D a lower bound on the routing time is Ω(C + D). The celebrated result of Leighton, Maggs and Rao (1988) established, non-constructively, the existence of a routing schedule which uses constant size buffers and ro...
متن کاملStochastic Analysis of Finite Population Bufferless Multiplexing in Optical Packet/Burst Switching Systems
In this letter, we study the blocking probabilities in an asynchronous optical packet/burst switching system with full wavelength conversion. Most of the existing work use Poisson traffic models that is well-suited for an infinite population of users. In this letter, the optical packet traffic arriving at the switching system is modeled through a superposition of a finite number of identical on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2007
ISSN: 0097-5397,1095-7111
DOI: 10.1137/050642095